Faster quantum concentration via Grover's search
نویسندگان
چکیده
One of the most important challenges in information networks is to gather data from a larger set nodes smaller nodes. This can be done via use concentrator architecture connection topology. paper proof-of-concept that demonstrates quantum-based controller large interconnection asymptotically perform this task faster. We specifically present quantum algorithms for routing concentration assignments on full capacity fat-and-slim concentrators, bounded and regular concentrators. Classically, assignment takes O(n) time all these where n number inputs. Powered by Grover's search algorithm, our take O(nclnc) time, c concentrator. Thus, are faster than their classical counterparts, when cln2c=o(n). In general, c=nμ, satisfies cln2c=o(n), implying complexity O(n0.5(1+μ)lnn), any μ,0<μ<1.
منابع مشابه
Faster Together: Collective Quantum Search
Joining independent quantum searches provides novel collective modes of quantum search (merging) by utilizing the algorithm’s underlying algebraic structure. If n quantum searches, each targeting a single item, join the domains of their classical oracle functions and sum their Hilbert spaces (merging), instead of acting independently (concatenation), then they achieve a reduction of the search ...
متن کاملFaster Database Search for Quantum computing
We propose a new algorithm for quantum database search. Our strategy is to partition the space of all possibilities into subspaces and use a judiciously chosen projection operator as a polarizer in every subspace to filter out the states which have the correct first n-2 qubits. Then we use Grover’s algorithm to determine which one of the four survived states is the oracle. This algorithm has th...
متن کاملA faster database search for quantum computing
We propose a new algorithm for quantum database search. Our strategy is to partition the space of all possibilities into subspaces and use a judiciously chosen projection operator as a polarizer in every subspace to filter out the states which have the correct first n-2 qubits. Then we use Grover’s algorithm to determine which one of the four survived states is the oracle. This algorithm has th...
متن کاملFaster Quantum Number Factoring via Circuit Synthesis
A major obstacle to implementing Shor’s quantum number-factoring algorithm is the large size of modular-exponentiation circuits. We reduce this bottleneck by customizing reversible circuits for modular multiplication to individual runs of Shor’s algorithm. Our circuit-synthesis procedure exploits spectral properties of multiplication operators and constructs optimized circuits from the traces o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Parallel, Emergent and Distributed Systems
سال: 2023
ISSN: ['1744-5779', '1744-5760']
DOI: https://doi.org/10.1080/17445760.2023.2231578